An adaptive Shiryaev-Roberts procedure for monitoring dispersion
نویسندگان
چکیده
In this paper, the Shiryaev-Roberts (SR) procedure is examined and compared with the change point CUSUM (CPC) procedure for monitoring the dispersion of a normal process. It will be shown that the SR chart performs better than the CPC chart for the pre-specified dispersion shift. In practice, when the magnitude of a future dispersion shift is unknown, it is always desired to design a control chart to perform reasonably well over a range of shifts rather than to optimize the performance at detecting a particular level of shifts. Compared with SR based on a pre-specified dispersion shift, an adaptive SR (ASR) chart that continually adjusts its form to be efficient for signaling a smoothing exponentially weighted moving average (EWMA) statistic in deviation from its target value is proposed in this paper. It can be easily implemented and numerical results show that it balances protection against a broad range of shift sizes. 2011 Elsevier Ltd. All rights reserved.
منابع مشابه
An Adaptive Shiryaev-Roberts Procedure for Signalling Varying Location Shifts
This paper proposes a new adaptive chart based on the Shiryaev-Roberts procedure, by updating the reference value in an adaptive way to achieve the aim of overall good performance over a range of future expected but unknown mean shifts. A two-dimensional Markov chain model is developed to analyze the run length performance. The design guidelines are given. The comparisons of run length performa...
متن کاملDesign and Comparison of Shiryaev-Roberts and CUSUM-Type Change-Point Detection Procedures
We address a simple changepoint detection problem where observations are i.i.d. before and after the change with known preand post-change distributions. For this setting, the CUSUM test is known to be optimal in the minimax setting for Lorden’s essential supremum metric, whereas the Shiryaev-Roberts procedure is optimal for detecting a change that occurs at a distant time horizon. At the same t...
متن کاملNearly Optimal Change-Point Detection with an Application to Cybersecurity
We address the sequential change-point detection problem for the Gaussian model where baseline distribution is Gaussian with variance 2 and mean such that 2 = a , where a > 0 is a known constant; the change is in from one known value to another. First, we carry out a comparative performance analysis of four detection procedures: the Cumulative Sum (CUSUM) procedure, the Shiryaev–Roberts (SR) pr...
متن کاملA Numerical Approach to Performance Analysis of Quickest Change-point Detection Procedures
For the most popular sequential change detection rules such as CUSUM, EWMA and the Shiryaev-Roberts test, we develop integral equations and a concise numerical method to compute a number of performance metrics including average detection delay and average time to false alarm. We pay special attention to the Shiryaev-Roberts procedure and evaluate its performance for various initialization strat...
متن کاملMinimax Optimality of Shiryaev-Roberts Procedure for Quickest Drift Change Detection of a Brownian motion
The problem of detecting a change in the drift of a Brownian motion is considered. The change point is assumed to have a modified exponential prior distribution with unknown parameters. A worst-case analysis with respect to these parameters is adopted leading to a min-max problem formulation. Analytical and numerical justifications are provided towards establishing that the Shiryaev-Roberts pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computers & Industrial Engineering
دوره 61 شماره
صفحات -
تاریخ انتشار 2011